Well-Founded Semantics for Default Logic

Default logic is one of the most popular approaches to model defeasible reasoning. Nevertheless, there are a number of problems with Reiter's original semantics that have led to the investigation of alternative approaches. In particular, Baral/Subrahmanian and Przymusinska/Przymusinski have investigated generalizations of well-founded semantics for normal logic programs to default logic. These generalizations have a number of interesting properties. Unfortunately, it turns out that in many realistic situations they are unable to draw any defeasible conclusions at all-which can hardly be viewed as satisfactory. We show how this diiculty can be solved by varying the xed point operator underlying the semantics. We deene a range of diierent semantics. All of them are correct wrt. safe conclusions under Reiter semantics, i.e. those conclusions with the same proof in all extensions. For the strongest semantics we have also completeness in the case of coherent default theories, i.e. default theories with at least one extension. The logics diier in the eeort spent for determining potential conclusions. It turns out that they are at least as complex as original default logic. We show that our approach also leads to new semantics for normal and extended logic programs. Moreover, we deene prioritized versions of the logics.